MAX-INJECTIVE, MAX-FLAT MODULES AND MAX-COHERENT RINGS
نویسندگان
چکیده
منابع مشابه
On Max-injective modules
$R$-module. In this paper, we explore more properties of $Max$-injective modules and we study some conditions under which the maximal spectrum of $M$ is a $Max$-spectral space for its Zariski topology.
متن کاملon max-injective modules
$r$-module. in this paper, we explore more properties of $max$-injective modules and we study some conditions under which the maximal spectrum of $m$ is a $max$-spectral space for its zariski topology.
متن کاملRandom Max 2-sat and Max Cut
Given a 2-SAT formula F consisting of n variables and b n random clauses, what is the largest number of clauses maxF satisfiable by a single assignment of the variables? We bound the answer away from the trivial bounds of 34 n and n. We prove that for < 1, the expected number of clauses satisfiable is b n o(1); for large , it is ( 34 + (p ))n; for = 1 + ", it is at least (1 + " O("3))n and at m...
متن کاملModelling Max-CSP as Partial Max-SAT
We define a number of original encodings that map MaxCSP instances into partial Max-SAT instances. Our encodings rely on the well-known direct and support encodings from CSP into SAT. Then, we report on an experimental investigation that was conducted to compare the performance profile of our encodings on random binary Max-CSP instances. Moreover, we define a new variant of the support encoding...
متن کاملOn fuzzy-rough attribute selection: Criteria of Max-Dependency, Max-Relevance, Min-Redundancy, and Max-Significance
Attribute selection is one of the important problems encountered in pattern recognition, machine learning, data mining, and bioinformatics. It refers to the problem of selecting those input attributes or features that are most effective to predict the sample categories. In this regard, rough set theory has been shown to be successful for selecting relevant and nonredundant attributes from a giv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Korean Mathematical Society
سال: 2010
ISSN: 1015-8634
DOI: 10.4134/bkms.2010.47.3.611